Output-size Sensitiveness of OBDD Construction Through Maximal Independent Set Problem
نویسندگان
چکیده
This paper investigates output-size sensitiveness of construction of OBDD by analyzing the maximal independent set problem of a graph, which would give several insights to e cient manipulation of Boolean functions by OBDD and graph theory.
منابع مشابه
OBDDs and (Almost) $k$-wise Independent Random Variables
OBDD-based graph algorithms deal with the characteristic function of the edge set E of a graph G = (V,E) which is represented by an OBDD and solve optimization problems by mainly using functional operations. We present an OBDD-based algorithm which uses randomization for the first time. In particular, we give a maximal matching algorithm with O(log |V |) functional operations in expectation. Th...
متن کاملLITERATURE REVIEW: Parallel algorithms for the maximal independent set problem in graphs
Let G = (V,E) be an undirected graph. An independent set of G is a subset I of V such that no two vertex in I are adjacent in G. A Maximal Independent Set (MIS) of G is an independent set such that adding any other vertex to it forces the set to contain an edge between two of its vertices. A Maximum independent Set (MaxIS) is a largest maximal independent set contained in V ; see Fig. 1. The pr...
متن کاملGlobal Forcing Number for Maximal Matchings under Graph Operations
Let $S= \{e_1,\,e_2, \ldots,\,e_m\}$ be an ordered subset of edges of a connected graph $G$. The edge $S$-representation of an edge set $M\subseteq E(G)$ with respect to $S$ is the vector $r_e(M|S) = (d_1,\,d_2,\ldots,\,d_m)$, where $d_i=1$ if $e_i\in M$ and $d_i=0$ otherwise, for each $i\in\{1,\ldots , k\}$. We say $S$ is a global forcing set for maximal matchings of $G$ if $...
متن کاملOn the complexity of minimizing the OBDD size for incompletely specified functions
The problem of constructing an OBDD cover of minimal size for an incompletely specified Boolean function arises in several applications in the CAD domain, e. g. the verification of sequential machines and the construction of OBDDs for incompletely specified circuits. The complexity of this problem is determined. The decision problem is NP–complete. Efficient approximation algorithms exist only ...
متن کاملUsing OBDDs for Efficient Query Evaluation on Probabilistic Databases
We consider the problem of query evaluation for tuple independent probabilistic databases and Boolean conjunctive queries with inequalities but without self-joins. We approach this problem as a construction problem for ordered binary decision diagrams (OBDDs): Given a query q and a probabilistic database D, we construct in polynomial time an OBDD such that the probability of q(D) can be compute...
متن کامل